package Sort;

public class insertionSort {
    public static void insertionSort(int[] a){

        for (int low = 1; low < a.length; low++) {
         int t = a[low];
         int i = low - 1;
            while(i >= 0 && a[i] > t){
                a[i + 1] = a[i];
                i--;
            }
                a[i + 1] = t;

        }
    }
}
